A polynomial time primal network simplex algorithm for minimum cost flows
نویسندگان
چکیده
منابع مشابه
A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract)
Developing a polynomial time algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n 2m log nC, n2m 2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and 0 otherwise. We first introduce a pseudopo...
متن کاملVisualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem
The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important of the research area of Network Optimization. Recently a new category of algorithms for the MCNFP have been developed. These algorithms belong to a special “exterior type” simplex category and they feature significant tree modifications. This paper presents a new didactic tool for the teaching of this type of a...
متن کاملEfficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
We study the number of pivots required by the primal network simplex algorithm to solve the minimum-cost circulation problem. We propose a pivot selection rule with a.bound -r -° on the number of pivots, for an nvertex network. This is the first known subexponential bound. The network simplex algorithm with this rule can be implemented. to run in n ogn) /2 + 0(l) tine." In the special case of p...
متن کاملNew polynomial-time cycle-canceling algorithms for minimum-cost flows
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting flows along negative cost directed cycles in the residual network G(x) and thereby canceling them. For the minimum cost flow problem with integral data, the generic version of the cycle-canceling algori...
متن کاملA Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem
Akgiil, M., A genuinely polynomial primal simplex algorithm for the assignment problem, Discrete Applied Mathematics 45 (1993) 93-l 15. We present a primal simplex algorithm that solves the assignment problem in :n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,. ..,lt. The algorithm utilizes degeneracy by working with strongly feasible trees and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1997
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf02614365